TSTP Solution File: SWV433^1 by cvc5-SAT---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5-SAT---1.0.5
% Problem : SWV433^1 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Nov 24 04:29:43 EST 2023
% Result : CounterSatisfiable 2.33s 2.62s
% Output : FiniteModel 2.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV433^1 : TPTP v8.1.2. Released v3.6.0.
% 0.10/0.13 % Command : do_cvc5 %s %d
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Nov 23 11:47:10 EST 2023
% 0.14/0.35 % CPUTime :
% 2.33/2.62 ------- cvc5-thf for SAT : /export/starexec/sandbox/tmp/tmp.i3maX3khxE/cvc5---1.0.5_16754.p at 300...
% 2.33/2.62 --- Run --uf-ho --finite-model-find --ho-elim at 2...
% 2.33/2.62 --- Run --uf-ho --finite-model-find...
% 2.33/2.62 % SZS status CounterSatisfiable for cvc5---1.0.5_16754
% 2.33/2.62 % SZS output start FiniteModel for cvc5---1.0.5_16754
% 2.33/2.62 (
% 2.33/2.62 ; cardinality of $$unsorted is 2
% 2.33/2.62 ; rep: (as @$$unsorted_0 $$unsorted)
% 2.33/2.62 ; rep: (as @$$unsorted_1 $$unsorted)
% 2.33/2.62 ; cardinality of tptp.individuals is 1
% 2.33/2.62 ; rep: (as @tptp.individuals_0 tptp.individuals)
% 2.33/2.62 (define-fun tptp.current_world () $$unsorted (as @$$unsorted_0 $$unsorted))
% 2.33/2.62 (define-fun tptp.prop_a ((BOUND_VARIABLE_4349 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.prop_b ((BOUND_VARIABLE_4352 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.prop_c ((BOUND_VARIABLE_4355 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.mfalse ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.mtrue ((BOUND_VARIABLE_4363 $$unsorted)) Bool true)
% 2.33/2.62 (define-fun tptp.mnot ((X (-> $$unsorted Bool)) (U $$unsorted)) Bool (not (@ X U)))
% 2.33/2.62 (define-fun tptp.mor ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (or (@ X U) (@ Y U)))
% 2.33/2.62 (define-fun tptp.mand ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) Bool (and (@ X U) (@ Y U)))
% 2.33/2.62 (define-fun tptp.mimpl ((U (-> $$unsorted Bool)) (V (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (or (not (@ U __flatten_var_0)) (@ V __flatten_var_0)))
% 2.33/2.62 (define-fun tptp.miff ((U (-> $$unsorted Bool)) (V (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (and (or (not (@ U __flatten_var_0)) (@ V __flatten_var_0)) (or (not (@ V __flatten_var_0)) (@ U __flatten_var_0))))
% 2.33/2.62 (define-fun tptp.mbox ((R (-> $$unsorted $$unsorted Bool)) (P (-> $$unsorted Bool)) (X $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (@ (@ R X) Y)) (@ P Y))))
% 2.33/2.62 (define-fun tptp.mdia ((R (-> $$unsorted $$unsorted Bool)) (P (-> $$unsorted Bool)) (X $$unsorted)) Bool (not (forall ((Y $$unsorted)) (or (not (@ (@ R X) Y)) (not (@ P Y))))))
% 2.33/2.62 (define-fun tptp.mall ((P (-> tptp.individuals $$unsorted Bool)) (W $$unsorted)) Bool (forall ((X tptp.individuals)) (@ (@ P X) W)))
% 2.33/2.62 (define-fun tptp.mexists ((P (-> tptp.individuals $$unsorted Bool)) (W $$unsorted)) Bool (not (forall ((X tptp.individuals)) (not (@ (@ P X) W)))))
% 2.33/2.62 (define-fun tptp.mvalid ((P (-> $$unsorted Bool))) Bool (forall ((W $$unsorted)) (@ P W)))
% 2.33/2.62 (define-fun tptp.msatisfiable ((P (-> $$unsorted Bool))) Bool (not (forall ((W $$unsorted)) (not (@ P W)))))
% 2.33/2.62 (define-fun tptp.mcountersatisfiable ((P (-> $$unsorted Bool))) Bool (not (forall ((W $$unsorted)) (@ P W))))
% 2.33/2.62 (define-fun tptp.minvalid ((P (-> $$unsorted Bool))) Bool (forall ((W $$unsorted)) (not (@ P W))))
% 2.33/2.62 (define-fun tptp.rel ((BOUND_VARIABLE_4367 $$unsorted) (BOUND_VARIABLE_4369 $$unsorted)) Bool (ite (= (as @$$unsorted_1 $$unsorted) BOUND_VARIABLE_4367) (= (as @$$unsorted_0 $$unsorted) BOUND_VARIABLE_4369) (and (= (as @$$unsorted_0 $$unsorted) BOUND_VARIABLE_4367) (= (as @$$unsorted_1 $$unsorted) BOUND_VARIABLE_4369))))
% 2.33/2.62 (define-fun tptp.icl_atom ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (@ (@ tptp.rel __flatten_var_0) Y)) (@ P Y))))
% 2.33/2.62 (define-fun tptp.icl_princ ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (@ P __flatten_var_0))
% 2.33/2.62 (define-fun tptp.icl_and ((A (-> $$unsorted Bool)) (B (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (and (@ A __flatten_var_0) (@ B __flatten_var_0)))
% 2.33/2.62 (define-fun tptp.icl_or ((A (-> $$unsorted Bool)) (B (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (or (@ A __flatten_var_0) (@ B __flatten_var_0)))
% 2.33/2.62 (define-fun tptp.icl_impl ((A (-> $$unsorted Bool)) (B (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (@ (@ tptp.rel __flatten_var_0) Y)) (not (@ A Y)) (@ B Y))))
% 2.33/2.62 (define-fun tptp.icl_true ((BOUND_VARIABLE_4363 $$unsorted)) Bool true)
% 2.33/2.62 (define-fun tptp.icl_false ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.icl_says ((A (-> $$unsorted Bool)) (S (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (@ (@ tptp.rel __flatten_var_0) Y)) (@ A Y) (@ S Y))))
% 2.33/2.62 (define-fun tptp.iclval ((X (-> $$unsorted Bool))) Bool (forall ((W $$unsorted)) (@ X W)))
% 2.33/2.62 (define-fun tptp.icl_impl_princ ((A (-> $$unsorted Bool)) (B (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) Bool (forall ((Y $$unsorted)) (or (not (@ (@ tptp.rel __flatten_var_0) Y)) (not (@ A Y)) (@ B Y))))
% 2.33/2.62 (define-fun tptp.admin ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.bob ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.alice ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 (define-fun tptp.deletefile1 ((BOUND_VARIABLE_4359 $$unsorted)) Bool false)
% 2.33/2.62 )
% 2.33/2.62 % SZS output end FiniteModel for cvc5---1.0.5_16754
% 2.33/2.62 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------